Admission Control to an M/M/1 Queue with Partial Information
نویسندگان
چکیده
We consider both a cooperative as well as non-cooperative admission into an M/M/1 queue. The only information available is a signal that sais whether the queue size is smaller than some L or not. We first compute the globally optimal and the Nash equilibrium stationary policy as a function of L. We compare the performance to that of full information on the queue size. We identify the L that optimizes the equilibrium performance.
منابع مشابه
Partial-Fraction Decomposition Approach to the M/H2/2 Queue
Here, a two server queueing system with Poisson arrivals and two different types of customers (M/H2/2 queue) is analyzed. A novel straightforward method is presented to acquire the exact and explicit forms of the performance measures. First, the steady state equations along with their Z-transforms are derived for the aforementioned queueing system. Using some limiting behaviors of the steady-st...
متن کاملA Monotonic Property of the Optimal Admission Control to an M/M/1 Queue under Periodic Observations with Average Cost Criterion
We consider the problem of admission control to an M/M/1 queue under periodic observations with average cost criterion. The admission controller receives the system state information every τ :th second and can accordingly adjust the acceptance probability for customers who arrive before the next state information update instance. For a period of τ seconds, the cost is a linear function of the t...
متن کاملOptimal Control of a Queue With High-Low Delay Announcements: The Significance of the Queue
This article deals with strategic control of price and information in a single-server model. It considers an M/M/1 system with identical customers. There is a single cut-off number, and the level of congestion is said to be low (high) if the queue length is less than (at least) this value. The firm can dynamically change the admission fee according to congestion level. Arriving customers cannot...
متن کاملM M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)
Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...
متن کاملAnalysis of a Single Server Queue with Working Vacation and Vacation Interruption
In this paper, an M/M/1 queue with working vacation and vacation interruption is investigated. The server is supposed to take a working vacation whenever the system becomes empty and if there are at least N customers waiting in the system at a service completion instant, vacation interruption happens and the server resumes a normal working period. A matrix geometric approach is employed to obta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013